max-flow min-cut theorem - translation to russian
Diclib.com
ChatGPT AI Dictionary
Enter a word or phrase in any language 👆
Language:

Translation and analysis of words by ChatGPT artificial intelligence

On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:

  • how the word is used
  • frequency of use
  • it is used more often in oral or written speech
  • word translation options
  • usage examples (several phrases with translation)
  • etymology

max-flow min-cut theorem - translation to russian

THEOREM IN OPTIMIZATION THEORY
Maximum flow minimum cut theorem; Max flow in networks; Maximum flow/minimum cut theorem; Max flow min cut theorem; Minimal cut; MFMC; Max-flow, mincut theorem; Maximum flow, minimum cut theorem; Max flow min cut; Maxflow-mincut; Min cut max flow; Max-flow min-cut; Max-flow-min-cut; Max-Flow Min-Cut theorem
  • Each black node denotes a pixel.
  • A network formulation of the project selection problem with the optimal solution

max-flow min-cut theorem         
теорема о максимальном потоке и минимальном разрезе
max-flow min-cut theorem         
теорема о максимальном потоке и минимальном разрезе
minimal cut         

математика

минимальный разрез (сети)

Definition

соя
1. ж.
1) Травянистое растение семейства бобовых, семена которого используются в пищевой промышленности для получения масла, молока, муки и т.п.
2) Острый соус из семян такого растения, служащий приправой к мясу и рыбе.
2. ж. устар.
То же, что: сойка.

Wikipedia

Max-flow min-cut theorem

In computer science and optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the total weight of the edges in a minimum cut, i.e., the smallest total weight of the edges which if removed would disconnect the source from the sink.

This is a special case of the duality theorem for linear programs and can be used to derive Menger's theorem and the Kőnig–Egerváry theorem.

What is the Russian for max-flow min-cut theorem? Translation of &#39max-flow min-cut theorem&#39 to